Se p 20 05 CONIC S - PROCEDURE AND CONSTRAINED DISSIPATIVITY
نویسنده
چکیده
A new version of classical S-procedure in system theory is proposed based on duality in the space of positive definite matrices and introduction of matrix Lagrange multipliers. A new proof and extension of the recent results [1] concerning equivalence between frequency domain inequality on finite frequency range and constrained dissipativity property for linear systems is given. The results of this paper extend S-procedure to allow for analysis and design of robust systems with matrix inequalities constraints.
منابع مشابه
Direct type-specific conic fitting and eigenvalue bias correction
A new method to fit specific types of conics to scattered data points is introduced. Direct, specific fitting of ellipses and hyperbolae is achieved by imposing a quadratic constraint on the conic coefficients, whereby an improved partitioning of the design matrix is devised so as to improve computational efficiency and numerical stability by eliminating redundant aspects of the fitting procedu...
متن کاملDirect and Specific Fitting of Conics to Scattered Data
A new method to fit specific types of conics to scattered data points is introduced. Direct, specific fitting of ellipses and hyperbolæ is achieved by imposing a quadratic constraint on the conic coefficients, whereby an improved partitioning of the design matrix is devised so as to improve computational efficiency and numerical stability by eliminating redundant aspects of the fitting procedur...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملA New Self-Dual Embedding Method for Convex Programming
In this paper we introduce a conic optimization formulation for inequality-constrained convex programming, and propose a self-dual embedding model for solving the resulting conic optimization problem. The primal and dual cones in this formulation are characterized by the original constraint functions and their corresponding conjugate functions respectively. Hence they are completely symmetric. ...
متن کاملPreoperative radiographic valgus alignment predicts the extent of lateral soft tissue release and need for constraint in valgus total knee arthroplasty
Background In total knee arthroplasty (TKA) for valgus knees, the decision to use a constrained implant is often made intraoperatively depending on the extent of soft tissue releases performed and residual soft tissue imbalance. The purpose of this study is to determine if preoperative radiographic criteria of valgus knees can predict the extent of soft tissue releases required and the level of...
متن کامل